turing reducible造句

That is, the problem is not Turing reducible to.
Two sets are Turing equivalent if each is Turing reducible to the other.
Now, this search problem is mutually poly-time Turing reducible with the following promise problem : given a Sudoku puzzle with at most one solution, decide whether it has a solution.
Although the natural examples of noncomputable sets are all many-one equivalent, it is possible to construct recursively enumerable sets " A " and " B " such that " A " is Turing reducible to " B " but not many-one reducible to " B ".
Equivalently, " A " is Turing reducible to " B " if and only if there is an algorithm for computing the indicator function for " A " provided that the algorithm is provided with a means to correctly answer questions of the form " Is " n " in " B " ? ".
It's difficult to find turing reducible in a sentence. 用turing reducible造句挺难的